ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE
نویسندگان
چکیده
منابع مشابه
On the Hitting Set of Bundles Problem
Le problème de l’ensemble minimal de paquets (minimal hitting set of bundles problem ou HSB) est défini comme suit. On dispose d’un ensemble E = {e1, e2, . . . , en} de n éléments. Chaque élément ei (i = 1, . . . , n) a un coût positif ou nul ci. Un paquet b est un sous ensemble de E . On dispose aussi d’une collection S = {S1, S2, . . . , Sm} de m ensembles de paquets. De manière plus précise,...
متن کاملEffect of Operators on Straight Line Complexity
We show that certain explicit operators must vastly increase the straight line complexity of certain polyno-mials.
متن کاملParameterized Algorithms for d-Hitting Set: the Weighted Case
We are going to analyze simple search tree algorithms for Weighted d-Hitting Set. Although the algorithms are simple, their analysis is technically rather involved. However, this approach allows us to even improve on elsewhere previously published running time estimates for the more restricted case of (unweighted) d-Hitting Set. 1
متن کاملParameterized Algorithms for Hitting Set: The Weighted Case
We are going to analyze simple search tree algorithms for Weighted d-Hitting Set. Although the algorithms are simple, their analysis is technically rather involved. However, this approach allows us to even improve on elsewhere previously published running time estimates for the more restricted case of (unweighted) d-Hitting Set. 1
متن کاملThe Robust Set Problem: Parameterized Complexity and Approximation
In this paper, we introduce the k-Robust Set problem: given a graph G = (V,E), a threshold function t : V → N and an integer k, find a subset of vertices V ′ ⊆ V of size at least k such that every vertex v in G has less than t(v) neighbors in V ′. This problem occurs in the context of the spread of undesirable agents through a network (virus, ideas, fire, . . .). Informally speaking, the proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ural mathematical journal
سال: 2016
ISSN: 2414-3952
DOI: 10.15826/umj.2016.2.010